Partial Deduction in the Framework of Structural Synthesis of Programs
نویسندگان
چکیده
The notion of partial deduction known from logic programming is deened in the framework of Structural Synthesis of Programs (SSP). Partial deduction for unconditional computability statements in SSP is deened. Completeness and correctness of partial deduction in the framework of SSP are proven. Several tactics and stopping criteria are suggested.
منابع مشابه
Partial Deduction for Structural Synthesis of Programs
The notion of partial deduction known from logic programming is deened in the framework of Structural Synthesis of Programs (SSP). Partial deduction for unconditional computability statements in SSP is deened. Completeness and correctness of partial deduction in the framework of SSP are proven. Several tactics and stopping criteria are suggested.
متن کاملPartial Structural Synthesis of Programs
The notion of partial deduction known from logic programming is deened in the framework of Structural Synthesis of Programs (SSP). Partial deduction for computability statements in SSP is deened. Completeness and correctness of partial deduction in the framework of SSP are proven. Several tactics and stopping criteria are suggested.
متن کاملStrategies of Structural Synthesis of Programs and its Extensions
Proof search for the structural synthesis of programs (SSP) — a deductive program synthesis method which is suited for compositional programming in large and is in practical use in a number of programming environments is explained. SSP is based on a decidable logical calculus where complexity of the proof search is still PSPACE. This requires paying special attention to the efficiency of search...
متن کاملPartial Deduction for Structured Logic Programming
In this paper we discuss an extension of Partial Deduction in the framework of structured logic programs. The class of programs we consider includes statically configured systems such as blockand inheritance-based systems, as well as more dynamic configurations which support hypothetical reasoning and viewpoints. We show that the basic Partial Deduction definition can be extended to deal with a...
متن کاملExtensions of Structural Synthesis of Programs
Structural synthesis of programs (SSP) is an approach to deductive synthesis of functional programs using types as speciications and based on the Curry-Howard correspondence and on an intensional treatment of the notion of type. The implemented programming environments employing SSP have been based on a fragment of intuitionistic propositional logic (simple type theory) and on a natural-deducti...
متن کامل